Collapsible graphs and Hamilton cycles of line graphs
نویسندگان
چکیده
منابع مشابه
Collapsible Graphs and Hamiltonicity of Line Graphs
Thomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai (Combinatorics and Graph Theory, vol 95, World Scientific, Singapore, pp 53–69; Conjecture 8.6 of 1995) conjectured that every 3-edge connected and essentially 6-edge connected graph is collapsible. Denote D3(G) the set of vertices of degree 3 of graph G. For e = uv ∈ E(G), define d(e) = d(u)+ d(v)− 2 the edge ...
متن کاملHamilton cycles in 5-connected line graphs
A conjecture of Carsten Thomassen states that every 4-connected line graph is hamiltonian. It is known that the conjecture is true for 7-connected line graphs. We improve this by showing that any 5-connected line graph of minimum degree at least 6 is hamiltonian. The result extends to claw-free graphs and to Hamilton-connectedness.
متن کاملCollapsible graphs and reductions of line graphs
A graph G is collapsible if for every even subset X ~ V(G), G has a subgraph r such that G E(J ') is connected and the set of odd-degree vertices of J' is X. A graph obtained by contracting all the non-trivial collapsible subgraphs of G is called the reduction of G. In this paper. we characterize graphs of diameter two in terms of collapsible subgraphs and investigate the relationship between t...
متن کاملHamilton cycles and closed trails in iterated line graphs
Let G be an undirected connected graph that is not a path. We define h(G) (respectively, s(G)) to be the least integer m such that the iterated line graph Lm(G) has a Hamiltonian cycle (respectively, a spanning closed trail). To obtain upper bounds on h(G) and s(G), we characterize the least integer m such that Lm(G) has a connected subgraph H, in which each edge of H is in a 3-cycle and V (H) ...
متن کاملCollapsible graphs and Hamiltonian connectedness of line graphs
Thomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai [Z.-H. Chen, H.-J. Lai, Reduction techniques for super-Eulerian graphs and related topics— an update, in: Ku Tung-Hsin (Ed.), Combinatorics and Graph Theory, vol. 95, World Scientific, Singapore/London, 1995, pp. 53–69, Conjecture 8.6] conjectured that every 3-edge connected, essentially 6-edge connected graph ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.05.030